Cross-Cultural Communication within American and Chinese Colleagues in Multinational Organizations

Globalization is a mantra nowadays that has been employed to describe the highly active exchange activities between countries and regions across the globe. It takes a multidimensional form, connecting people and things regardless of spatial and temporal confines, and permeating into all walks of life. Along with changes brought by this dynamic international interaction, a myriad of organizations, no longer isolated and static, are beginning to ride on this gravy train by expanding tentacles into every cranny and nook of the globe. One of the challenges that is facing the multinational organizations is the increasing diversity of the workforce and similarly complex prospective customers with disparate cultural backgrounds. After all, language barriers, cultural nuances, and value divergence can easily cause unintended misunderstanding and low efficiency in internal communication in a multinational environment. It leads to conflict among employees and profit loss in organizational productivity. Therefore, in international organization, cross-cultural communication, also known as intercultural and trans-cultural communication, serves as a lubricant, which mitigates frictions, resolves conflicts, and improves overall work efficiency; likewise, it serves as coagulant, which integrates the collective wisdom and strength, enhances the collaboration of team work, and unites multiple cultures together between race and ethnicity, which leads to desirable virtuous circle of synergy effect. This paper identifies three aspects of culture that constitute people’s understanding between each other in professional settings, namely, language and non-language code; cultural values and beliefs; as well as cultural stereotypes and preconceptions

Structural Resolution with Co-inductive Loop Detection

A way to combine co-SLD style loop detection with structural resolution was found and is introduced in this work, to extend structural resolution with co-induction. In particular, we present the operational semantics, called co-inductive structural resolution, of this novel combination and prove its soundness with respect to the greatest complete Herbrand model.Comment: In Proceedings CoALP-Ty'16, arXiv:1709.0419

Color-decoupled photo response non-uniformity for digital image forensics

The last few years have seen the use of photo response non-uniformity noise (PRNU), a unique fingerprint of imaging sensors, in various digital forensic applications such as source device identification, content integrity verification and authentication. However, the use of a colour filter array for capturing only one of the three colour components per pixel introduces colour interpolation noise, while the existing methods for extracting PRNU provide no effective means for addressing this issue. Because the artificial colours obtained through the colour interpolation process is not directly acquired from the scene by physical hardware, we expect that the PRNU extracted from the physical components, which are free from interpolation noise, should be more reliable than that from the artificial channels, which carry interpolation noise. Based on this assumption we propose a Couple-Decoupled PRNU (CD-PRNU) extraction method, which first decomposes each colour channel into 4 sub-images and then extracts the PRNU noise from each sub-image. The PRNU noise patterns of the sub-images are then assembled to get the CD-PRNU. This new method can prevent the interpolation noise from propagating into the physical components, thus improving the accuracy of device identification and image content integrity verification

Weight distributions of cyclic codes with respect to pairwise coprime order elements

Let $\Bbb F_r$ be an extension of a finite field $\Bbb F_q$ with $r=q^m$. Let each $g_i$ be of order $n_i$ in $\Bbb F_r^*$ and $\gcd(n_i, n_j)=1$ for $1\leq i \neq j \leq u$. We define a cyclic code over $\Bbb F_q$ by $$\mathcal C_{(q, m, n_1,n_2, ..., n_u)}=\{c(a_1, a_2, ..., a_u) : a_1, a_2, ..., a_u \in \Bbb F_r\},$$ where $$c(a_1, a_2, ..., a_u)=({Tr}_{r/q}(\sum_{i=1}^ua_ig_i^0), ..., {Tr}_{r/q}(\sum_{i=1}^ua_ig_i^{n-1}))$$ and $n=n_1n_2... n_u$. In this paper, we present a method to compute the weights of $\mathcal C_{(q, m, n_1,n_2, ..., n_u)}$. Further, we determine the weight distributions of the cyclic codes $\mathcal C_{(q, m, n_1,n_2)}$ and $\mathcal C_{(q, m, n_1,n_2,1)}$.Comment: 18 pages. arXiv admin note: substantial text overlap with arXiv:1306.527

Quantum secure direct communication based on supervised teleportation

We present a quantum secure direct communication(QSDC) scheme as an extension for a proposed supervised secure entanglement sharing protocol. Starting with a quick review on the supervised entanglement sharing protocol -- the "Wuhan" protocol [Y. Li and Y. Liu, arXiv:0709.1449v2], we primarily focus on its further extend using for a QSDC task, in which the communication attendant Alice encodes the secret message directly onto a sequence of 2-level particles which then can be faithfully teleported to Bob using the shared maximal entanglement states obtained by the previous "Wuhan" protocol. We also evaluate the security of the QSDC scheme, where an individual self-attack performed by Alice and Bob -- the out of control attack(OCA) is introduced and the robustness of our scheme on the OCA is documented.Comment: 5 pages, 1 table, oral contribution in the Conference on Quantum Optics and Applications in Computing and Communications, Photonics Asia 2007, Proc. of SPI

Productive Corecursion in Logic Programming

Logic Programming is a Turing complete language. As a consequence, designing algorithms that decide termination and non-termination of programs or decide inductive/coinductive soundness of formulae is a challenging task. For example, the existing state-of-the-art algorithms can only semi-decide coinductive soundness of queries in logic programming for regular formulae. Another, less famous, but equally fundamental and important undecidable property is productivity. If a derivation is infinite and coinductively sound, we may ask whether the computed answer it determines actually computes an infinite formula. If it does, the infinite computation is productive. This intuition was first expressed under the name of computations at infinity in the 80s. In modern days of the Internet and stream processing, its importance lies in connection to infinite data structure processing. Recently, an algorithm was presented that semi-decides a weaker property -- of productivity of logic programs. A logic program is productive if it can give rise to productive derivations. In this paper we strengthen these recent results. We propose a method that semi-decides productivity of individual derivations for regular formulae. Thus we at last give an algorithmic counterpart to the notion of productivity of derivations in logic programming. This is the first algorithmic solution to the problem since it was raised more than 30 years ago. We also present an implementation of this algorithm.Comment: Paper presented at the 33nd International Conference on Logic Programming (ICLP 2017), Melbourne, Australia, August 28 to September 1, 2017 16 pages, LaTeX, no figure

Mining for Useful Association Rules Using the ATMS

Association rule mining has made many achievements in the area of knowledge discovery in databases. Recent years, the quality of the extracted association rules has drawn more and more attention from researchers in data mining community. One big concern is with the size of the extracted rule set. Very often tens of thousands of association rules are extracted among which many are redundant thus useless. In this paper, we first analyze the redundancy problem in association rules and then propose a novel ATMS-based method for extracting non-redundant association rules